Hash tree - PDFSEARCH.IO - Document Search Engine

Hash tree
Results: 206

#	Item
41	Fast Search in Hamming Space with Multi-Index Hashing Mohammad Norouzi Ali Punjani David J. Fleet Department of Computer Science University of Toronto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2012-06-28 15:40:37 Mathematics Hash function Locality-sensitive hashing Hash table Nearest neighbor search Hamming weight Trie K-d tree Hamming distance Search algorithms Information science Information retrieval
42	technische universiteit eindhoven 2IL05 Data Structures Exam Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-04-13 05:28:53 Theoretical computer science Search algorithms Analysis of algorithms Binary search tree Merge sort Algorithm Insertion sort Hash table Time complexity Mathematics Order theory Sorting algorithms
43	Exam, June 6, 2011 Jesper Larsson, ITU Instructions What to bring. You can bring any written aid you want. This includes the course book and a dictionary. In fact, these two things are the only aids that make sense, so I Add to Reading List Source URL: itu.dk Language: English - Date: 2011-11-09 08:00:40 Computing Binary trees Abstract data types Binary search tree Binary heap Priority queue Insertion sort Hash table Heapsort Graph theory Mathematics Sorting algorithms
44	LARGE-SCALE SPEAKER IDENTIFICATION Ludwig Schmidt∗ Matthew Sharifi and Ignacio Lopez Moreno MIT Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2015-05-25 21:19:32 Mathematics Locality-sensitive hashing Nearest neighbor search Hash function Speech recognition Hash table K-nearest neighbor algorithm K-d tree Information retrieval Search algorithms Information science Artificial intelligence
45	Distance Estimation and Object Location via Rings of Neighbors ∗ Aleksandrs Slivkins† February 2005 Revised: June 2005, Nov 2005, April 2006, SeptAbstract Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2006-09-17 17:37:38 Distributed data storage Routing Distributed hash table Shortest path problem Travelling salesman problem Tree decomposition Koorde Pastry Graph theory Theoretical computer science Mathematics
46	Building A Scalable Multimedia Search Engine Using Infiniband Qi Chen1 , Yisheng Liao2 , Christopher Mitchell2, Jinyang Li2 , and Zhen Xiao1 1 Department 2 Department of Computer Science, Peking University Add to Reading List Source URL: news.cs.nyu.edu Language: English - Date: 2014-06-11 16:04:37 Information retrieval Nearest neighbor search K-nearest neighbor algorithm Search engine indexing Hash function Hash table K-d tree InfiniBand Distributed hash table Information science Computing Search algorithms
47	Zerocoin: Anonymous Distributed E-Cash from Bitcoin Ian Miers, Christina Garman, Matthew Green, Aviel D. Rubin The Johns Hopkins University Department of Computer Science, Baltimore, USA {imiers, cgarman, mgreen, rubin}@ Add to Reading List Source URL: zerocoin.org Language: English Electronic commerce Financial cryptography Bitcoin Peer-to-peer computing Cryptographic protocols Proof-of-work system Hash tree Electronic money Double-spending Cryptography Computing Payment systems
48	Bitcoin: A Peer-to-Peer Electronic Cash System Satoshi Nakamoto www.bitcoin.org Abstract. A purely peer-to-peer version of electronic cash would allow online Add to Reading List Source URL: bravenewcoin.com Language: English - Date: 2014-07-15 20:21:51 Hashing Computing Software Bitcoin Peer-to-peer computing Hash tree Hash list Hash function Cryptographic nonce Cryptography Error detection and correction Cryptographic hash functions
49	Scalable Algorithms for Constructing Balanced Spanning Trees on System-ranked Process Groups Akhil Langer, Ramprasad Venkataraman, and Laxmikant Kale Department of Computer Science University of Illinois at Urbana-Champa Add to Reading List Source URL: charm.cs.illinois.edu Language: English - Date: 2012-09-08 17:52:14 Spanning tree Parallel computing Message Passing Interface Search algorithms Hash function Time complexity MPICH Theoretical computer science Concurrent computing Computing
50	High Performance Dynamic Lock-Free Hash Tables and List-Based Sets Maged M. Michael IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NYUSA Add to Reading List Source URL: www.research.ibm.com Language: English - Date: 2004-08-02 14:09:15 Computer programming Linked list Hash table Trie Mutual exclusion Non-blocking algorithm Compare-and-swap Software transactional memory Tree traversal Concurrency control Computing Data management